Error Bounds for Minimal
نویسندگان
چکیده
We derive error bounds for bivariate spline interpolants which are calculated by minimizing certain natural energy norms. x1. Introduction Suppose we are given values ff(v)g v2V of an unknown function f at a set V of scattered points in IR 2. To approximate f, we choose a linear space S of polynomial splines of degree d deened on a triangulation 4 with vertices at the points of V. be the set of all splines in S that interpolate f at the points of V. We assume that S is big enough so that U f is nonempty. Then a commonly used way to create an approximation of f (cf. 8{12]) is to choose a spline S f such that E(S f) = min s2U f E(s); (1:2) where E(s) := X T24 Z T s 2 xx + 2s 2 xy + s 2 yy : (1:3) We refer to S f as the minimal energy interpolating spline.
منابع مشابه
Error bounds in approximating n-time differentiable functions of self-adjoint operators in Hilbert spaces via a Taylor's type expansion
On utilizing the spectral representation of selfadjoint operators in Hilbert spaces, some error bounds in approximating $n$-time differentiable functions of selfadjoint operators in Hilbert Spaces via a Taylor's type expansion are given.
متن کاملSome bounds on unitary duals of classical groups - non-archimeden case
We first give bounds for domains where the unitarizabile subquotients can show up in the parabolically induced representations of classical $p$-adic groups. Roughly, they can show up only if the central character of the inducing irreducible cuspidal representation is dominated by the square root of the modular character of the minimal parabolic subgroup. For unitarizable subquotients...
متن کاملApproximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees
We give a new lower bound on the length of the minimal Steiner tree with a given topology joining given terminals in Euclidean space, in terms of toroidal images. The lower bound is equal to the length when the topology is full. We use the lower bound to prove bounds on the “error” e in the length of an approximate Steiner tree, in terms of the maximum deviation d of an interior angle of the tr...
متن کاملBounds on 2-Query Codeword Testing
We present upper bounds on the size of codes that are locally testable by querying only two input symbols. For linear codes, we show that any 2-locally testable code with minimal distance δn over any finite field F cannot have more than |F| codewords. This result holds even for testers with two-sided error. For general (non-linear) codes we obtain the exact same bounds on the code size as a fun...
متن کاملComplexity of oscillatory integration for univariate Sobolev spaces
We analyze univariate oscillatory integrals for the standard Sobolev spaces Hs of periodic and non-periodic functions with an arbitrary integer s ≥ 1. We find matching lower and upper bounds on the minimal worst case error of algorithms that use n function or derivative values. We also find sharp bounds on the information complexity which is the minimal n for which the absolute or normalized er...
متن کاملThe complexity of de nite elliptic problems with noisy dataTechnical Report CUCS - 035 - 96
We study the complexity of 2mth order deenite elliptic problems Lu = f (with homogeneous Dirichlet boundary conditions) over a d-dimensional domain , error being measured in the H m (()-norm. The problem elements f belong to the unit ball of W r;p ((), where p 2 2; 1] and r > d=p. Information consists of (possibly-adaptive) noisy evaluations of f or the coeecients of L. The absolute error in ea...
متن کامل